A Fast Single-Key Two-Level Universal Hash Function
نویسندگان
چکیده
منابع مشابه
A Fast Single-Key Two-Level Universal Hash Function
Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functions require ` − 1 field multiplications for hashing a message consisting of ` blocks where each block is one field element. A faster method is based on the class of Bernstein-Rabin-Winograd (BRW) polynomials which require b`/2c multiplications and blg...
متن کاملKey-Recovery Attacks on Universal Hash Function Based MAC Algorithms
This paper discusses key recovery and universal forgery attacks on several MAC algorithms based on universal hash functions. The attacks use a substantial number of verification queries but eventually allow for universal forgeries instead of existential or multiple forgeries. This means that the security of the algorithms completely collapses once a few forgeries are found. Some of these attack...
متن کاملSquare Hash: Fast Message Authentication Via Optimized Universal Hash Functions?
This paper introduces two new ideas in the construction of fast universal hash functions geared towards the task of message authen-tication. First, we describe a simple but novel family of universal hash functions that is more eecient than many standard constructions. We compare our hash functions to the MMH family studied by Halevi and Krawczyk 13]. All the main techniques used to optimize MMH...
متن کاملSQUARE HASH: Fast Message Authenication via Optimized Universal Hash Functions
This paper introduces two new ideas in the construction of fast universal hash functions geared towards the task of message authen-tication. First, we describe a simple but novel family of universal hash functions that is more eecient than many standard constructions. We compare our hash functions to the MMH family studied by Halevi and Krawczyk 12]. All the main techniques used to optimize MMH...
متن کاملTWOBLOCK: A Fast New Hash Function
In this paper, the author studies the fast cryptographic hash function. This work suggests a different notion with respect to the traditional hash functions, MD5, SHA-1, and Whirlpool. The notion of block cipher based hash function is abandoned. According to the flexibility of attack, it shows how this hash function is no longer vulnerable to the known collision attacks. Finally, the author pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR Transactions on Symmetric Cryptology
سال: 2017
ISSN: 2519-173X
DOI: 10.46586/tosc.v2017.i1.106-128